Comments on “a distributed algorithm for distributed termination”

Comments on "Ring Based Termination Detection Algorithm for Distributed Computations"

A Robust Distributed Termination Detection Algorithm

IN 47907-2-ABSTRACf When all the processes in a distributed program are idle, either a global termination condition exists or all the processes are deadlocked. A distributed algorithm to detect the global tennination condition is presented. The algorithm is general and can be incorporated as an underlying mechanism with any distributed programming system. The proposed methodology is immune to p...

Derivation of a Termination Detection Algorithm for Distributed Computations

The purpose of this paper is twofold, viz. to present a new [0] algorithm for the detection of the termination of a distributed computation and to demonstrate how the algorithm can be derived in a number of steps. We consider N machines, each of which is either active or passive. Only active machines send so-called ‘messages’ to other machines; message transmission is considered instantaneous. ...

A Robust Distributed Estimation Algorithm under Alpha-Stable Noise Condition

Robust adaptive estimation of unknown parameter has been an important issue in recent years for reliable operation in the distributed networks. The conventional adaptive estimation algorithms that rely on mean square error (MSE) criterion exhibit good performance in the presence of Gaussian noise, but their performance drastically decreases under impulsive noise. In this paper, we propose a rob...

Refinement Based Validation of an Algorithm for Detecting Distributed Termination

We present the development and the validation of an algorithm for detecting the termination of diffusing computations. Although such a problem has been extensively studied, to the best of our knowledge, this is the first one which is based on the maximal paths generated by a diffusing computation. After an informal presentation of the algorithm, we proceed to its rigorous development within the...